Single source single-commodity stochastic network design
نویسندگان
چکیده
منابع مشابه
Single source single-commodity stochastic network design
Stochastics affects the optimal design of a network. This paper examines the single-source single-commodity stochastic network design problem. We characterize the optimal designs under demand uncertainty and compare with the deterministic counterparts to outline the basic structural differences. We do this partly as a basis for developing better algorithms than are available today, partly to si...
متن کاملSingle-Commodity Stochastic Network Design with Multiple Sources and Sinks
This paper examines the single-commodity stochastic network design problem with multiple sources and sinks. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this primarily to understand what constitutes good robust network designs, but hope that the understanding can also be used to develop better heuristic algorithms than those availa...
متن کاملSingle Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables
Single commodity networks are considered, where demands at the nodes are random. The problem is to find minimum cost optimal capacities at the nodes and arcs subject to the constraint that all demands should be met on a prescribed probability level (reliability constraint) and some constraints on the capacities should be satisfied. The reliability constraint is formulated in terms of the Gale–H...
متن کاملSingle-commodity network design with random edge capacities
This paper examines the single-commodity network design problem with stochastic edge capacities. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this partly to understand what constitutes robust network designs, but also to construct a heuristic for the stochastic problem, leading to optimality gaps of about 10%. In our view, that is ...
متن کاملSingle-Source Stochastic Routing
We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source and multiple sinks, and demands that have known values but unknown sizes. We assume that the sizes of demands are governed by independent distributions, and that we know only the means of these distributions and an upper bound on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Management Science
سال: 2011
ISSN: 1619-697X,1619-6988
DOI: 10.1007/s10287-010-0129-0